Genetic lateral tuning for subgroup discovery with fuzzy rules using the algorithm NMEEF-SD
نویسندگان
چکیده
منابع مشابه
Genetic lateral tuning for subgroup discovery with fuzzy rules using the algorithm NMEEF-SD
The main objective of subgroup discovery is to discover interesting and interpretable patterns with respect to a specific property. The use of evolutionary fuzzy systems provides good algorithms to approach this problem. In this sense, NMEEF-SD algorithm –one of the most representative evolutionary fuzzy systems for subgroup discovery– obtains precise and interpretable subgroups. However in the...
متن کاملGenetic Algorithm with Gradient Based Tuning for Constructing Fuzzy Rules
This paper presents a hybrid method to construct concise and comprehensible fuzzy rules from training data. The construction procedure consists of a genetic algorithm, which determines the rulebase, and a gradient based optimization for the tuning of the membership functions. An approximation of the well-known Lukasiewicz logic is used to describe both the fuzzy connectives and the memberships,...
متن کاملSubgroup Discovery with CN2-SD
This paper investigates how to adapt standard classification rule learning approaches to subgroup discovery. The goal of subgroup discovery is to find rules describing subsets of the population that are sufficiently large and statistically unusual. The paper presents a subgroup discovery algorithm, CN2-SD, developed by modifying parts of the CN2 classification rule learner: its covering algorit...
متن کاملFuGePSD: Fuzzy Genetic Programming-based algorithm for Subgroup Discovery
Evolutionary Fuzzy Systems (EFSs) are fuzzy systems augmented by a learning process based on evolutionary computation such as evolutionary algorithms (EAs). These systems contribute with several advantages in the development of algorithms, and specifically in the development of subgroup discovery (SD) approaches. SD is a descriptive data mining technique using supervised learning in order to de...
متن کاملSD-Map - A Fast Algorithm for Exhaustive Subgroup Discovery
In this paper we present the novel SD-Map algorithm for exhaustive but efficient subgroup discovery. SD-Map guarantees to identify all interesting subgroup patterns contained in a data set, in contrast to heuristic or samplingbased methods. The SD-Map algorithm utilizes the well-known FP-growth method for mining association rules with adaptations for the subgroup discovery task. We show how SD-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2012
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2012.685323